package com.topInterview;

/**
 * @Author: huangzhigao
 * @Date: 2022/2/20 20:48
 */
public class leecode104_DepthTree {


    public int maxDepth(leecode102_Leveltraversal.TreeNode root) {
        if (root == null) {
            return 0;
        }

        return Math.max(maxDepth(root.left), maxDepth(root.right)) + 1;
    }
}
